Error-Resilient Tile Sets for DNA Self-Assembly
نویسندگان
چکیده
Experiments have demonstrated that DNA molecules can compute like a machine to solve mathematical problems, which is significant because of their parallel computation ability. However, due to the nature of biochemical reactions, DNA computation suffers from errors, which are its main limitation. The abstract and kinetic Tile Assembly Models are now commonly used to simulate real DNA computing experiments, and to look for new methods to advance the accuracy of DNA-based computation. One means of controlling errors is through proofreading tile sets. Several such tile sets have been proposed in the literature, such as Chen and Goel’s snaked proofreading tile sets, the 2-way and 3-way overlay tile sets of Reif et al., and Rothemund and Cook’s n-way overlay tile sets. In the first part of this thesis, we analyze the performance of the Rothemund-Cook n-way overlay tile sets. We prove that the n-way overlay tile set contains n +3n+4 rule tiles. Simulation results show that these tile sets clearly perform better than tile sets without any error-control mechanism, and the performance improves as n increases. It is also proved that the error rates in assemblies formed by the 1-way and 2-way tile sets are O(ǫ), where ǫ is the error rate in assemblies without any error correction. In the second part of this thesis, we focus on a different error mechanism, namely, i errors caused by imperfect or malformed tiles. We propose a model of malformed tiles, and consider the performance of various proofreading tile sets in the presence of malformed tiles. Our simulation results show that the Reif et al. 3-way overlay tile sets are able to best deal with malformed tiles. During the simulations, we observed that snaked proofreading tile sets always have trouble completing whole patterns when malformed tiles are present. We instead propose two modified snaked proofreading constructions, and verify through both simulations and analysis that the two modified constructions have much better performances.
منابع مشابه
Compact Error-Resilient Computational DNA Tilings
The self-assembly process for bottom-up construction of nanostructures is of key importance to the emerging scientific discipline Nanoscience. However, algorithmic self-assembly at the molecular scale is prone to a quite high rate of error. Such high error rate is a major barrier to large-scale experimental implementation of algorithmic DNA tilings. The goals of this paper are to develop theore...
متن کاملCapabilities and Limits of Compact Error Resilience Methods for Algorithmic Self-assembly in Two and Three Dimensions
Winfree’s pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly[26], but the construction resulted in increase of the size of assembly. Reif et. al. contributed further in this area with compact error-resilient schemes [15] that maintained the original size of the assemblies, but required certain restrictions on the Boolean functions to be used in the al...
متن کاملCompact Error-Resilient Computational DNA Tiling Assemblies
The self-assembly process for bottom-up construction of nanostructures is of key importance to the emerging scientific discipline Nanoscience. However, self-assembly at the molecular scale is prone to a quite high rate of error. Such high error rate is a major barrier to large-scale experimental implementation of DNA tiling. The goals of this paper are to develop theoretical methods for compact...
متن کاملProofreading Tile Sets: Error Correction for Algorithmic Self-Assembly
For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of physical conditions, such as temperature and the concentration of tiles, errors (ε) can be reduced to an arbitrarily low rate – but at the cost of reduced speed (r) for the self-assembly process. For tile sets directly implemen...
متن کاملActivatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this paper we describe a novel protection/deprotection strategy to strictly enforce the direction of tiling assembly growth to ensure the robustness of the assembly process. Tiles are initially inactive, meaning that each tile...
متن کامل